Exactm-covers of Groups by Cosets

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exactm-covers of Groups by Cosets

Let G be a group covered by its left cosets a1G1, · · · , akGk exactly m times. It is known that [G : ⋂k i=1 Gi] 6 k!. When all the Gi are subnormal in G and ⋂k i=1 Gi = H, we are able to determine the least value of k in terms of m,G,H. For any i = 1, · · · , k, providing G/(Gi)G is solvable we show that k > m + f([G : Gi]) and hence [G : Gi] 6 2k−m, where f(n) = ∑r s=1 αs(ps − 1) if p1 1 · · ...

متن کامل

On Covers of Abelian Groups by Cosets

Let G be any abelian group and {asGs}ks=1 be a finite system of cosets of subgroups G1, . . . , Gk. We show that if {asGs} k s=1 covers all the elements of G at least m times with the coset atGt irredundant then [G : Gt] 6 2 and furthermore k > m + f([G : Gt]), where f( ∏ r i=1 p αi i ) = ∑ r i=1 αi(pi − 1) if p1, . . . , pr are distinct primes and α1, . . . , αr are nonnegative integers. This ...

متن کامل

Finite Covers of Groups by Cosets or Subgroups

Abstract. This paper deals with combinatorial aspects of finite covers of groups by cosets or subgroups. Let a1G1, . . . , akGk be left cosets in a group G such that {aiGi} k i=1 covers each element of G at least m times but none of its proper subsystems does. We show that if G is cyclic, or G is finite and G1, . . . , Gk are normal Hall subgroups of G, then the inequality k > m + f([G : ⋂ k i=...

متن کامل

Theta functions on covers of symplectic groups

We study the automorphic theta representation $Theta_{2n}^{(r)}$ on the $r$-fold cover of the symplectic group $Sp_{2n}$‎. ‎This representation is obtained from the residues of Eisenstein series on this group‎. ‎If $r$ is odd‎, ‎$nle r

متن کامل

Automatic groups, subgroups and cosets

The history, definition and principal properties of automatic groups and their generalisations to subgroups and cosets are reviewed briefly, mainly from a computational perspective. A result about the asynchronous automaticity of an HNN extension is then proved and applied to an example that was proposed by Mark Sapir. AMS Classification 20F32; 20F05

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2001

ISSN: 0195-6698

DOI: 10.1006/eujc.2000.0466